On-the-Fly Model Checking of Fair Non-repudiation Protocols
نویسندگان
چکیده
A fair non-repudiation protocol should guarantee, (1) when a sender sends a message to a receiver, neither the sender nor the receiver can deny having participated in this communication; (2) no principals can obtain evidence while the other principals cannot do so. This paper extends the model in our previous work [12], and gives a sound and complete on-the-fly model checking method for fair non-repudiation protocols under the assumption of a bounded number of sessions. We also implement the method using Maude. Our experiments automatically detect flaws of several fair non-repudiation protocols.
منابع مشابه
A Game-Based Verification of Non-repudiation and Fair Exchange Protocols
In this paper, we report on a recent work for the verification of non-repudiation protocols. We propose a verification method based on the idea that non-repudiation protocols are best modeled as games. To formalize this idea, we use alternating transition systems, a game based model, to model protocols and alternating temporal logic, a game based logic, to express requirements that the protocol...
متن کاملA Theorem-Proving Approach to Verification of Fair Non-repudiation Protocols
We use a PVS embedding of the stable failures model of CSP to verify non-repudiation protocols, allowing us to prove the correctness of properties that are difficult to analyze in full generality with a model checker. The PVS formalization comprises a semantic embedding of CSP and a collection of theorems and proof rules for reasoning about non-repudiation properties. The well-known Zhou-Gollma...
متن کاملAn Extended Payment Model for M-Commerce with Fair Non-Repudiation Protocols
commerce, is still at the start. In this paper, we propose an extension of existing mobile payment models to introduce an extended mobile payment service (EMPS) model, which is based on assumptions about the cooperation between mobile network operators and financial institutions to deal with different payment amounts ranging from micro to macro payment. The novel model focuses on enhancement of...
متن کاملAn Extended Payment Model with Fair Non-Repudiation Protocols for M-Commerce
This paper proposes an extended mobile payment service model founded on the existing ones to solve the non-repudiation problems with fair non-repudiation protocols for all phases in a typical m-commerce transaction. The novel model bases on assumptions about the cooperation between mobile network operators and financial institutions to deal with different payment amounts ranging from micro to m...
متن کاملSecurity Analysis of (Un-) Fair Non-repudiation Protocols
An approach to protocol analysis using asynchronous product automata (APA) and the simple homomorphism verification tool (SHVT) is demonstrated on several variants of the well known ZhouGollmann fair non-repudiation protocol. Attacks on these protocols are presented, that, to our knowledge, have not been published before. Finally, an improved version of the protocol is proposed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007